Counterfactual Effect, the Halting Problem, and the Busy Beaver Function
نویسندگان
چکیده
Using the counterfactual effect, we demonstrate that with better than 50% chance we can determine whether an arbitrary universal Turing machine will halt on an arbitrarily given program. As an application we indicate a probabilistic method for computing the busy beaver function— a classical uncomputable function. These results suggest a possibility of going beyond the Turing barrier.
منابع مشابه
The Euclid Abstract Machine: Trisection of the Angle and the Halting Problem
What is the meaning of hypercomputation, the meaning of computing more than the Turing machine? Concrete non-computable functions always hide the halting problem as far as we know. Even the construction of a function that grows faster than any recursive function — the Busy Beaver — a more natural function, hides the halting function, that can easily be put in relation with the Busy Beaver. Is t...
متن کاملBetti numbers of finitely presented groups and very rapidly growing functions
Define the length of a finite presentation of a group G as the sum of lengths of all relators plus the number of generators. How large can be the kth Betti number bk(G) = rank Hk(G) providing that G has length ≤ N and bk(G) is finite? We prove that for every k ≥ 3 the maximum bk(N) of kth Betti numbers of all such groups is an extremely rapidly growing function of N . It grows faster that all f...
متن کاملDynamical systems approach to the Busy Beaver problem
The purpose of this paper is to reconsider the Busy Beaver problem, which is a modification of the Turing machine’s halting problem, in the light of a dynamical systems approach. Numerical experiments show that the spatio-temporal patterns of machines can be roughly classified into four types. In particular, well-regulated and self-similar patterns are found in most longer-lived machines, which...
متن کاملRelativizing an incompressible number and an incompressible function through subrecursive extensions of Turing machines
We show in this article that uncomputability is also a relative property of subrecursive classes built on a recursive relative incompressible function, which acts as a higher-order “yardstick” of irreducible information for the respective subrecursive class. We define the concept of a Turing submachine, and a recursive relative version for the Busy Beaver function and for the halting probabilit...
متن کاملSmall Turing machines and generalized busy beaver competition
Let TM(k, l) be the set of one-tape Turing machines with k states and l symbols. It is known that the halting problem is decidable for machines in TM(2, 3) and TM(3, 2). We prove that the decidability of machines in TM(2, 4) and TM(3, 3) will be difficult to settle, by giving machines in these sets for which the halting problem depends on an open problem in number theory. A machine in TM(5, 2) ...
متن کامل